Random walks on Galton–Watson trees with random conductances
نویسندگان
چکیده
منابع مشابه
On symmetric random walks with random conductances on Z
We study models of continuous time, symmetric, Zd-valued random walks in random environments. One of our aims is to derive estimates on the decay of transition probabilities in a case where a uniform ellipticity assumption is absent. We consider the case of independent conductances with a polynomial tail near 0 and obtain precise asymptotics for the annealed return probability and convergence t...
متن کاملOn the speed of Random Walks among Random Conductances
We consider random walk among random conductances where the conductance environment is shift invariant and ergodic. We study which moment conditions of the conductances guarantee speed zero of the random walk. We show that if there exists α > 1 such that E[log ωe] < ∞, then the random walk has speed zero. On the other hand, for each α < 1 we provide examples of random walks with non-zero speed ...
متن کاملQuenched invariance principles for random walks with random conductances
We prove an almost sure invariance principle for a random walker among i.i.d. conductances in Zd, d ≥ 2. We assume conductances are bounded from above but we do not require that they are bounded from below.
متن کاملRandom walks on complex trees.
We study the properties of random walks on complex trees. We observe that the absence of loops is reflected in physical observables showing large differences with respect to their looped counterparts. First, both the vertex discovery rate and the mean topological displacement from the origin present a considerable slowing down in the tree case. Second, the mean first passage time (MFPT) display...
متن کاملRandom Walks on Rooted Trees
For arbitrary positive integers h and m, we consider the family of all rooted trees of height h having exactly m vertices at distance h from the root. We refer to such trees as (h,m)-trees. For a tree T from this family, we consider a simple random walk on T which starts at the root and terminates when it visits one of the m vertices at distance h from the root. Consider the problem of finding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Stochastic Processes and their Applications
سال: 2012
ISSN: 0304-4149
DOI: 10.1016/j.spa.2012.01.004